Algorithms implementing distributed shared memory - Computer
نویسندگان
چکیده
raditionally, communication sage passing) communication system. The among processes in a distributed shared memory model applied to loosely a system is based on the data-passing model. Message-passing systems or systems that support remote procedure calls (RPCs) adhere to this model. The data-passing model logically and conveniently extends the underlying communication mechanism of the system; port or mailbox abstractions along with primitives such as Send and Receive are used for interprocess communication. This functionality can also be hidden in languagelevel constructs, as with RPC mechanisms. In either case, distributed processes pass shared information by value. This article compares several algorithms for implementing distributed shared memory. It shows that the performance of these algorithms is sensitive to the memory access behavior of applications. In contrast to the data-passing model, the shared memory model provides pro-
منابع مشابه
Implementing distributed shared memory based on DCE
The Distributed Computing Environment (DCE) software of the Open Software Foundation o ers solutions for security problems and for shared le management in heterogeneous computer networks. It allows distributed programming by remote procedure calls and parallel programming by threads. Distributed shared memory in a computer network pretends a globally shared address space among networked compute...
متن کاملAn Improved Lazy Release Consistency Model
Problem statement: A network of workstations, viewed as a distributed shared memory system can be used to develop and test parallel algorithms. Approach: For implementing parallel algorithms on such DSMs shared memory consistency model plays a vital role. Results: However on a LAN, strict consistency models like Sequential Consistency model (SC) are not useful since the communication is slow. I...
متن کاملA Methodology for Generating Efficient Disk-Based Algorithms from Tensor Product Formulas
In this paper, we address the issue of automatic generation of disk-based algorithms from tensor product formulas. Disk-based algorithms are required in scientiic applications which work with large data sets that do not t entirely into main memory. Tensor products have been used for designing and implementing block recursive algorithms on shared-memory, vector and distributed-memory multiproces...
متن کاملScalability Evaluation of Barrier Algorithms for OpenMP
OpenMP relies heavily on barrier synchronization to coordinate the work of threads that are performing the computations in a parallel region. A good implementation of barriers is thus an important part of any implementation of this API. As the number of cores in shared and distributed shared memory machines continues to grow, the quality of the barrier implementation is critical for application...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کامل